Locality-Based Aggregate Computation in Wireless Sensor Networks

نویسندگان

  • Jen-Yeu Chen
  • Jianghai Hu
چکیده

The design of efficient gossip-based protocols for computing aggregate functions in wireless sensor network has received considerable attention recently. A primary reason for this surge in interest is their robustness due to their randomized nature. In addition, because of the inherent simplicity in their design, gossip-based protocols are suitable to be implemented on sensor nodes with limited computing capability and battery power. In the context of energy-constrained sensor networks, it is of paramount importance to reduce the message and time complexity of gossip-based protocols. In this paper, we present DRRgossip, an energy-efficient and robust aggregate computation algorithm in sensor networks. Exploiting locality, the Distributed Random Ranking (DRR) algorithm first builds a forest of disjoint local trees over the sensor network. The height of each tree is small, so that the aggregates of the tree nodes can be quickly obtained at the root of the tree. All the roots then perform a uniform gossip algorithm on their respective aggregates to reach a distributed consensus on the global aggregate. We prove that the DRR-gossip algorithm requires O(n) messages and O( n 3/2 log1/2 n ) transmissions to obtain aggregates on a random geometric graph. This reduces the energy consumption by at least a factor of 1 log n over the standard uniform gossip algorithm. Experiments validate the theoretical results and show that DRR-gossip needs much less transmissions than other gossip-based schemes. Index Terms wireless sensor networks; aggregate computation; gossip; distributed algorithm; randomized algorithm; random geometric graph Jen-Yeu Chen is with the Department of Electrical Engineering, National Dong Hwa University, Taiwan, R.O.C. Email:[email protected]. Gopal Pandurangan is with the Department of Computer Science, Purdue University, West Lafayette, USA. E-mail:[email protected]. Jianghai Hu is with the School of Electrical and Computer Engineering, Purdue University, West Lafayette, USA. E-mail: [email protected]. 2 SUBMITTED FOR PUBLICATION TO JSAC SI: SIMPLE WIRELESS SENSOR NETWORKING SOLUTIONS, APRIL 21, 2009

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm

Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...

متن کامل

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

Target Tracking Based on Virtual Grid in Wireless Sensor Networks

One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009